On a weighted embedding for generalized pontograms
نویسندگان
چکیده
منابع مشابه
On a weighted embedding for generalized pontograms
A weighted embedding for the generalized pontogram {Kn(t): 06t61} corresponding pointwise to a renewal process {N (s): 06s¡∞} via Kn(t)=n−1=2(N (nt)− tN (n)) is studied in this paper. After proper normalization, weak convergence results for the processes {Kn(t): 06t61} are derived both in sup-norm as well as in Lp-norm. These results are suggested to serve as asymptotic testing devices for dete...
متن کاملPhishing website detection using weighted feature line embedding
The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...
متن کاملSome Weighted Integral Inequalities for Generalized Conformable Fractional Calculus
In this paper, we have obtained weighted versions of Ostrowski, Čebysev and Grüss type inequalities for conformable fractional integrals which is given by Katugompola. By using the Katugampola definition for conformable calculus, the present study confirms previous findings and contributes additional evidence that provide the bounds for more general functions.
متن کاملAffinity Weighted Embedding
Supervised linear embedding models like WSABIE (Weston et al., 2011) and supervised semantic indexing (Bai et al., 2010) have proven successful at ranking, recommendation and annotation tasks. However, despite being scalable to large datasets they do not take full advantage of the extra data due to their linear nature, and we believe they typically underfit. We propose a new class of models whi...
متن کاملAffinity Weighted Embedding
Supervised linear embedding models like WSABIE (Weston et al., 2011) and supervised semantic indexing (Bai et al., 2010) have proven successful at ranking, recommendation and annotation tasks. However, despite being scalable to large datasets they do not take full advantage of the extra data due to their linear nature, and we believe they typically underfit. We propose a new class of models whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2000
ISSN: 0304-4149
DOI: 10.1016/s0304-4149(00)00002-8